The β-Delaunay tessellation II: the Gaussian limit tessellation

Seal Identification Using the Delaunay Tessellation

A new approach which differs from the conventional pattern recognition techniques in partitioning a seal imprint image into a triangular tessellation is proposed. The image plane is segmented into a mesh of triangles according to the Delaunay triangulation paradigm, and the distribution of the triangular area is used as the primary feature for matching unrecognized seal imprints with model imag...

Geometric Properties of the Adaptive Delaunay Tessellation

Recently, the Adaptive Delaunay Tessellation (Adt) was introduced in the context of computational mechanics as a tool to support Voronoi-based nodal integration schemes in the finite element method. While focusing on applications in mechanical engineering, the former presentation lacked rigorous proofs for the claimed geometric properties of the Adt necessary for the computation of the nodal in...

Automatic Mesh Generation Using a Modified Delaunay Tessellation

System Identification using Delaunay Tessellation of Self-Organizing Maps

The Self-Organizing Map (SOM) is a vector quantization method which places prototype vectors on a regular low-dimensional grid in an ordered fashion. A new method to obtain piecewise linear models of dynamic processes is presented. The operating regimes of the local linear models are obtained by the Delaunay tessellation of the codebook of the SOM. The proposed technique is demonstrated by mean...

A Comparison of Five Implementations of 3D Delaunay Tessellation

When implementing Delaunay tessellation in 3D, a number of engineering decisions must be made about update and location algorithms, arithmetics, perturbations, and representations. We compare five codes for computing 3D Delaunay tessellation: qhull, hull, CGAL, pyramid, and our own tess3, and explore experimentally how these decisions affect the correctness and speed of computation, particularl...